Parallel Signcryption with OAEP, PSS-R, and other Feistel Paddings

نویسندگان

  • Yevgeniy Dodis
  • Michael J. Freedman
  • Shabsi Walfish
چکیده

We present a new, elegant composition method for joint signature and encryption, also referred to assigncryption. The new method, which we call Padding-based Parallel Signcryption (PbPS), builds an effi-cient signcryption scheme from any family of trapdoor permutations, such as RSA. Each user U generates asingle public/secret key pair fU/f −1Uused for both sending and receiving the data. To signcrypt a messagem to a recipient with key frcv, a sender with key fsnd efficiently transforms m into a pair 〈w, s〉, and simplysends frcv(w)‖f −1snd(s). PbPS enjoys many attractive properties: simplicity, efficiency, generality, paral-lelism of “encrypting”/“signing”, optimal exact security, flexible and ad-hoc key management, key reuse forsending/receiving data, optimally-low message expansion, long message and associated data support, and,finally, complete compatibility with the PKCS#1 infrastructure.The pairs 〈w, s〉 sufficient for the security of PbPS are called universal two-padding schemes. Usingone round of the Feistel transform, we give a very general construction of such schemes. Interestingly, wenotice that all popular padding schemes with message recovery used for plain signature or encryption, suchas OAEP, OAEP+, PSS-R, and “scramble all, encrypt small” [21], naturally consist of two pieces 〈w, s〉.Quite remarkably, we show that all such pairs become special cases of our construction. As a result, we finda natural generalization of all conventional padding schemes, and show that any such padding can be usedfor signcryption with PbPS. However, none of such paddings gives optimal message bandwidth. For thatpurpose and of independent interest, we define a new “hybrid” between PSS-R and OAEP, which we callProbabilistic Signature-Encryption Padding (PSEP). We recommend using PbPS with PSEP to achievethe most flexible and secure signcryption scheme up-to-date. To justify this point, we provide a detailedpractical comparison of PbPS/PSEP with other previously-proposed signcryption candidates.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simplified OAEP for the RSA and Rabin Functions

Optimal Asymmetric Encryption Padding (OAEP) is a technique for converting the RSA trapdoor permutation into a chosen ciphertext secure system in the random oracle model. OAEP padding can be viewed as two rounds of a Feistel network. We show that for the Rabin and RSA trapdoor functions a much simpler padding scheme is sufficient for chosen ciphertext security in the random oracle model. We sho...

متن کامل

Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way Permutation

Coron et al. proposed the ES-based scheme PSS-ES which realizes an encryption scheme and a signature scheme with a unique padding technique and key pair. The security of PSS-ES as an encryption scheme is based on the partial-domain one-wayness of the encryption permutation. In this paper, we propose new ES schemes OAEP-ES, OAEP++-ES, and REACT-ES, and prove their security under the assumption o...

متن کامل

Chosen-Ciphertext Security without Redundancy

We propose asymmetric encryption schemes for which all ciphertexts are valid (which means here “reachable”: the encryption function is not only a probabilistic injection, but also a surjection). We thus introduce the Full-Domain Permutation encryption scheme which uses a random permutation. This is the first IND-CCA cryptosystem based on any trapdoor one-way permutation without redundancy, and ...

متن کامل

Provable Security and Indifferentiability

In this thesis we consider different problems related to provable security and indifferentiability framework. Ideal primitives such as random oracles, ideal ciphers are theoretical abstractions of cryptographic hash functions and block ciphers respectively. These idealized models help us to argue security guarantee for various cryptographic schemes, for which standard model security proofs are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2003  شماره 

صفحات  -

تاریخ انتشار 2003